Single-machine scheduling against due dates with past-sequence-dependent setup times
نویسندگان
چکیده
منابع مشابه
Single-machine scheduling against due dates with past-sequence-dependent setup times
Recently Koulamas and Kyparisis (2006) introduced past-sequence-dependent setup times to scheduling problems. This means that the setup time of a job is proportionate to the sum of processing times of the jobs already scheduled. Koulamas and Kyparisis (2006) were able to show for a number of single-machine scheduling problems with completion time goals that they remain polynomially solvable. In...
متن کاملSingle-machine scheduling with release dates, due dates and family setup times
We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery performance, between maximizing machine utilization by batching similar jobs and maximizing customers’ satis...
متن کاملSingle-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis
Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis V. Mani, Pei-Chann Chang* and Shih-Hsin Chen Department of Aerospace Engineering, Indian Institute of Science, Bangalore, India; Department of Information Management, Yuan Ze University, 135, Yuan-Dong Road, Tao-Yuan 320, Taiwan, R.O.C.; Department of Electronic Commerce Management, Na...
متن کاملSingle-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times
We consider single-machine scheduling problems with past-sequence-dependent (p-s-d) job delivery times. The p-s-d delivery time is needed to remove any waiting time-induced adverse effects on the job’s condition (prior to delivering the job to the customer) and it is therefore proportional to the job’s waiting time. We show that single-machine scheduling problems with p-s-d delivery times and w...
متن کاملSingle-machine scheduling with waiting-time-dependent due dates
We consider a single-machine scheduling problem in which due dates are linear functions of the job waiting-times and the objective is to minimize the maximum lateness. An optimal sequence is constructed by implementing an index-based priority rule for a fixed value of the due date normalizing constant k. We determine in polynomial time all the k value ranges so that the optimal sequence remains...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2008
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2007.08.028